Single retrial queues with service option on arrival
نویسندگان
چکیده
منابع مشابه
Bernoulli Vacation Policy for a Bulk Retrial Queue with Fuzzy Parameters
In this paper, we investigate the fuzzy logic based system characteristics of MX/G/1 retrial queuing system with Bernoulli vacation schedule. The service time and vacation time are assumed to be generally distributed. It is found in many practical situations that the queuing models with fuzzy parameters are much more realistic than the classical crisp parameters based queuing models. We have...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملA Model of Rational Retrials in Queues
Consumers often have to join a queue before they can obtain a service; however, they suffer disutility in waiting for the service. When consumers can self-organize the timing of their service visits, they may avoid long queues and choose to retry later. Nevertheless, the existing research on decision-making in queues has focused mainly on join or balk decisions, while acknowledging that some co...
متن کاملBatch Arrival M/g/1 Retrial Queueing System with General Retrial Time, Bernoulli Schedule Vacation, Multi Second Optional Heterogeneous Service and Repair Facility
Retrial queueing systems are characterized by the fact that a primary request, finding all servers and waiting positions busy upon arrival, leaves the service area but after some random time, repeats its demand. Between retrials, the customer is said to be in “Orbit”. So the repeated attempts for service from the group of blocked customers are super imposed on the normal stream of arrivals of p...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JAMDS
دوره 1 شماره
صفحات -
تاریخ انتشار 1997